منابع مشابه
Oriented Interval Greedoids
We propose a definition of an oriented interval greedoid that simultaneously generalizes the notion of an oriented matroid and the construction on antimatroids introduced by L. J. Billera, S. K. Hsiao, and J. S. Provan in Enumeration in convex geometries and associated polytopal subdivisions of spheres [Discrete Comput. Geom. 39 (2008), no. 1-3, 123–137]. As for of oriented matroids, associated...
متن کاملNon-interval greedoids and the transposition property
In previous papers we have mainly studied greedoids with the interval property. This paper exhibits 11 classes of greedoids whose members do not necessarily have the interval property. These non-interval greedoids are related to some fundamental algorithms and procedural principles like Gaussian elimination, blossom trees, series-parallel decomposition, ear decomposition, retracting and dismant...
متن کاملInterval greedoids and families of local maximum stable sets of graphs
A maximum stable set in a graph G is a stable set of maximum cardinality. S is a local maximum stable set of G, and we write S ∈ Ψ(G), if S is a maximum stable set of the subgraph induced by S ∪ N(S), where N(S) is the neighborhood of S. Nemhauser and Trotter Jr. [21], proved that any S ∈ Ψ(G) is a subset of a maximum stable set of G. In [14] we have shown that the family Ψ(T ) of a forest T fo...
متن کاملWell-covered Graphs and Greedoids
G is a well-covered graph provided all its maximal stable sets are of the same size (Plummer, 1970). S is a local maximum stable set of G, and we denote by S ∈ Ψ(G), if S is a maximum stable set of the subgraph induced by S ∪ N(S), where N(S) is the neighborhood of S. In 2002 we have proved that Ψ(G) is a greedoid for every forest G. The bipartite graphs and the trianglefree graphs, whose famil...
متن کاملGraph Operations that are Good for Greedoids
S is a local maximum stable set of G, and we write S 2 (G), if S is a maximum stable set of the subgraph induced by S [N(S), where N(S) is the neighborhood of S. Nemhauser and Trotter Jr. [5] proved that any S 2 (G) is a subset of a maximum stable set of G. In [1] we have proved that (G) is a greedoid for every forest G. The cases of bipartite graphs and triangle-free graphs were analyzed in [2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2011
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-011-9383-3